Sovremennyy algoritm lazernoy koagulyatsii setchatki pri diabeticheskoy retinopatii

FAST: A Functional Algoritm Simulation Testbed

In this paper we extend the practical range of simulations of parallel executions by what we call \func-tional algorithm simulation," that is, simulation without actually performing most of the numerical computations involved. We achieve this by introducing a new approach for generating and collecting communication and computation characteristics for a class of parallel scientiic algorithms. We...

A Parsing Algoritm That Extends Phrases

It is desirable for a parser to be able to extend a phrase even after it has been combined into a larger syntactic unit. This paper presents an algorithm that does this in two ways, one dealing with "right extension" and the other with "left recursion". A brief comparison with other parsing algorithms shows it to be related to the left corner parsing algorithm, but it is more flexible in the or...

Convergence Properties of the BFGS Algoritm

The BFGS method is one of the most famous quasi-Newton algorithms for unconstrained optimization. In 1984, Powell presented an example of a function of two variables that shows that the Polak–Ribière–Polyak (PRP) conjugate gradient method and the BFGS quasi-Newton method may cycle around eight nonstationary points if each line search picks a local minimum that provides a reduction in the object...

pre pri nt

Aim We studied different species of gooseneck barnacles from the globally distributed rafting genus Lepas to examine whether the most widespread species are true cosmopolitans and to explore the factors influencing the phylogeny and biogeography of these epipelagic rafters. Methods We used a phylogenetic approach based on mitochondrial 16S and coI sequences, and the nuclear 18S gene to elucidat...

Shopbots and Pri ebots